Exponential Single Server Queues in an Interactive Random Environment
نویسندگان
چکیده
We consider exponential single server queues with state-dependent arrival and service rates that evolve under influences of external environments. The transitions the are influenced by environment’s state movements environment depend on status (bidirectional interaction). is constructed in a way to encompass various models from recent Operations Research literature, where queue coupled an inventory or reliability issues. With Markovian joint queueing-environment process, we prove separability for large class such interactive systems; is, steady distribution product form explicitly given. processes decouple asymptotically state. For nonseparable systems, develop ergodicity criteria via Lyapunov functions. By examples explain principles bounding departure served customers (throughputs) systems throughputs related separable as upper lower bound.
منابع مشابه
stationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملFairness and Scheduling in Single Server Queues
Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...
متن کاملAn Approximation for Performance Evaluation of Stationary Single Server Queues
This paper provides a method for approzimating the probability distributions of stationary statistics in FIFO single server queues. The method is based on the Wiener Hopf factorization technique, and is applied to semi-Markov queues where the underlying state space is of unlimited size. A particularly important case is a model for a statistical multiplezer where the net input process forms a st...
متن کاملSingle-server queues with spatially distributed arrivals
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server’s movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The se...
متن کاملSome Inequalities for Single Server Queues
The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic systems
سال: 2023
ISSN: ['1946-5238']
DOI: https://doi.org/10.1287/stsy.2023.0106